Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s
نویسندگان
چکیده
Marc Hellmuth1,2∗Adrian Fritz2 Nicolas Wieseke3† Peter F. Stadler4−8 1 Department of Mathematics and Computer Science, University of Greifswald, Greifswald, Germany 2 Center for Bioinformatics, Saarland University, Saarbrücken, Germany 3 Parallel Computing and Complex Systems Group, Department of Computer Science, Leipzig University, Germany 4 Bioinformatics Group, Dept. of Computer Science & Interdisciplinary Center of Bioinformatics, Leipzig University 5 Max Planck Institute for Mathematics in the Sciences, Leipzig 6 Institute for Theoretical Chemistry, University of Vienna, Austria 7 Center for non-coding RNA in Technology and Health, Copenhagen Univ., Denmark 8 The Santa Fe Institute, Santa Fe, USA
منابع مشابه
Merging Modules is equivalent to Editing P4's
The modular decomposition of a graph G = (V,E) does not contain prime modules if and only if G is a cograph, that is, if no quadruple of vertices induces a simple connected path P4. The cograph editing problem consists in inserting into and deleting from G a set F of edges so that H = (V,E4F) is a cograph and |F | is minimum. This NP-hard combinatorial optimization 1 ar X iv :1 70 2. 07 49 9v 1...
متن کاملExact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملThe new genomic editing system (CRISPR)
Over the past decades, progression in genetic element manipulation, and consequently, the treatment of diseases has been remarkable. It is worth noting that these genetic manipulations perform at different levels, including DNA and RNA. The earlier genomic editing techniques, including MN, ZFN , TALEN , performing their functions by creating double-stranded breaks (DSBs), and after breakage, th...
متن کاملPotential Application of Novel DNA Editing Techniques in Translational Neuroscience
No abstract is provided.
متن کاملSimpler Editing of Spatially-Connected Graph Hierarchies using Zipping Algorithms
Graph hierarchies, the data structures that result from hierarchically clustering the nodes of a graph, are widely used as a multi-scale way of representing data in many computing fields, including image segmentation, mesh simplification, hierarchical pathfinding and visualisation. As a result, significant efforts have been made over the years to find ways of constructing ‘good’ graph hierarchi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.06983 شماره
صفحات -
تاریخ انتشار 2015